- Voronoi polyhedra
- полиэдры Вороного (используются для изучения локальной структуры молекул воды вблизи молекулы растворенного вещества)
Англо-русский словарь промышленной и научной лексики. 2014.
Voronoi polyhedra
Смотреть что такое "Voronoi polyhedra" в других словарях:
Voronoi diagram — The Voronoi diagram of a random set of points in the plane (all points lie within the image). In mathematics, a Voronoi diagram is a special kind of decomposition of a given space, e.g., a metric space, determined by distances to a specified… … Wikipedia
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
Truncated octahedron — (Click here for rotating model) Type Archimedean solid Uniform polyhedron Elements F = 14, E = 36, V = 24 (χ = 2) Faces by sides 6 … Wikipedia
Rhombic dodecahedron — The rhombic dodecahedron is a convex polyhedron with 12 rhombic faces. It is an Archimedean dual solid, or a Catalan solid. Its dual is the cuboctahedron. Properties It is the polyhedral dual of the cuboctahedron, and a zonohedron. The long… … Wikipedia
Zonohedron — A zonohedron is a convex polyhedron where every face is a polygon with point symmetry or, equivalently, symmetry under rotations through 180°. Any zonohedron may equivalently be described as the Minkowski sum of a set of line segments in three… … Wikipedia
Discrete geometry — A collection of circles and the corresponding unit disk graph Combinatorial geometry redirects here. The term combinatorial geometry is also used in the theory of matroids to refer to a simple matroid, especially in older texts. Discrete geometry … Wikipedia
Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… … Wikipedia
List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… … Wikipedia
Polyèdre — Un polyèdre est une forme géométrique à trois dimensions ayant des faces planes polygonales qui se rencontrent selon des segments de droite qu on appelle arêtes. Le mot « polyèdre »[1] provient du grec classique πολύεδρον (polyedron)… … Wikipédia en Français
Tessellation — A tessellation of pavement A honeycomb is an example of a t … Wikipedia
Doubly connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects … Wikipedia
